import java.util.Arrays;
import java.util.List;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 86183
 * Date: 2022-10-10
 * Time: 22:27
 */
public class TestTree {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTreeNode("AB#D##C##");
        binaryTree.preorder(root);
        System.out.println();
        System.out.println(binaryTree.size(root));
        System.out.println(binaryTree.getLeafNodeCount(root));
        System.out.println(binaryTree.getKLevelNodeCount(root, 4));
        System.out.println(binaryTree.getHeight(root));
        if(binaryTree.find(root,'B') != null){
            System.out.println("Yes");
        }else {
            System.out.println("No");
        }
        binaryTree.levelOrder(root);
        System.out.println();
        System.out.println(binaryTree.isCompleteTree(root));
        List<List<Character>> ret = binaryTree.leveOrder1(root);
        for (List<Character> x : ret) {
            System.out.println(x);
       }
    }
}
